Les Automates d’Ordre-Partiel et les Équivalences Comportementales Partial-Order Automata and Behavioural Equivalences

The modelling of concurrent systems by synchronized distributed automata generates a natural independence notion between events of the global system. The theory of Mazurkiewicz traces suggests that such an independence relation induces an equivalence relation over the sequences of events of the system. So-called Partial-Order Automata use independence for the reductions of the interleaved global system. We investigate their use for the verification of behavioural relations such as (finitary) language inclusion or bisimulations. The limits of the approach are shown as well as suggestions for practical applications and some experimental results on classical examples. MOTS-CLÉS : Verification, Bisimulation, Méthodes d’Ordre-Partiel, Réseaux d’Automates, Reduction